Termination w.r.t. Q of the following Term Rewriting System could not be shown:
Q restricted rewrite system:
The TRS R consists of the following rules:
f(0, 1, X) → h(X, X)
h(0, X) → f(0, X, X)
g(X, Y) → X
g(X, Y) → Y
Q is empty.
↳ QTRS
Q restricted rewrite system:
The TRS R consists of the following rules:
f(0, 1, X) → h(X, X)
h(0, X) → f(0, X, X)
g(X, Y) → X
g(X, Y) → Y
Q is empty.